78 research outputs found
Y-compatible and strict Y-compatible functions
AbstractLet Y ∈ Rn. A function f : Rn → Rk is Y-compatible, if for any Z ∈ Rn, Z ≤ Y if and only if f(Z) ≤ f(Y) and is strict Y-compatible, if for any Z ∈ Rn, Z < Y if and only if f(Z) < f(Y). It is proved that for any Y ∈ Rn, n ≥ 2, there is no Y-compatible polynomial function f : Rn → Rk, 1 ≤ k < n. It is also proved that for a differentiable strict Y-compatible map f, Jf(Y) = 0, where Jf(Y) denote the Jacobian matrix of the mapping f in Y. These problems arose in studying data compression of analog signatures
Improved bounds on the L(2,1)-number of direct and strong products of graphs
2007-2008 > Academic research: refereed > Publication in refereed journalVersion of RecordPublishe
The generalized 3-edge-connectivity of lexicographic product graphs
The generalized -edge-connectivity of a graph is a
generalization of the concept of edge-connectivity. The lexicographic product
of two graphs and , denoted by , is an important graph
product. In this paper, we mainly study the generalized 3-edge-connectivity of
, and get upper and lower bounds of .
Moreover, all bounds are sharp.Comment: 14 page
Infinite motion and 2-distinguishability of graphs and groups
A group A acting faithfully on a set X is 2-distinguishable if there is a 2-coloring of X that is not preserved by any nonidentity element of A, equivalently, if there is a proper subset of X with trivial setwise stabilizer. The motion of an element a in A is the number of points of X that are moved by a, and the motion of the group A is the minimal motion of its nonidentity elements. When A is finite, the Motion Lemma says that if the motion of A is large enough (specifically at least 2 log_2 |A|), then the action is 2-distinguishable. For many situations where X has a combinatorial or algebraic structure, the Motion Lemma implies that the action of Aut(X) on X is 2-distinguishable in all but finitely many instances.
We prove an infinitary version of the Motion Lemma for countably infinite permutation groups, which states that infinite motion is large enough to guarantee 2-distinguishability. From this we deduce a number of results, including the fact that every locally finite, connected graph whose automorphism group is countably infinite is 2-distinguishable. One cannot extend the Motion Lemma to uncountable permutation groups, but nonetheless we prove that (under the permutation topology) every closed permutation group with infinite motion has a dense subgroup which is 2-distinguishable. We conjecture an extension of the Motion Lemma which we expect holds for a restricted class of uncountable permutation groups, and we conclude with a list of open questions. The consequences of our results are drawn for orbit equivalence of infinite permutation groups
Convexity in partial cubes: the hull number
We prove that the combinatorial optimization problem of determining the hull
number of a partial cube is NP-complete. This makes partial cubes the minimal
graph class for which NP-completeness of this problem is known and improves
some earlier results in the literature.
On the other hand we provide a polynomial-time algorithm to determine the
hull number of planar partial cube quadrangulations.
Instances of the hull number problem for partial cubes described include
poset dimension and hitting sets for interiors of curves in the plane.
To obtain the above results, we investigate convexity in partial cubes and
characterize these graphs in terms of their lattice of convex subgraphs,
improving a theorem of Handa. Furthermore we provide a topological
representation theorem for planar partial cubes, generalizing a result of
Fukuda and Handa about rank three oriented matroids.Comment: 19 pages, 4 figure
Ramified rectilinear polygons: coordinatization by dendrons
Simple rectilinear polygons (i.e. rectilinear polygons without holes or
cutpoints) can be regarded as finite rectangular cell complexes coordinatized
by two finite dendrons. The intrinsic -metric is thus inherited from the
product of the two finite dendrons via an isometric embedding. The rectangular
cell complexes that share this same embedding property are called ramified
rectilinear polygons. The links of vertices in these cell complexes may be
arbitrary bipartite graphs, in contrast to simple rectilinear polygons where
the links of points are either 4-cycles or paths of length at most 3. Ramified
rectilinear polygons are particular instances of rectangular complexes obtained
from cube-free median graphs, or equivalently simply connected rectangular
complexes with triangle-free links. The underlying graphs of finite ramified
rectilinear polygons can be recognized among graphs in linear time by a
Lexicographic Breadth-First-Search. Whereas the symmetry of a simple
rectilinear polygon is very restricted (with automorphism group being a
subgroup of the dihedral group ), ramified rectilinear polygons are
universal: every finite group is the automorphism group of some ramified
rectilinear polygon.Comment: 27 pages, 6 figure
The variety of domination games
Domination game (Brešar et al. in SIAM J Discrete Math 24:979–991, 2010) and total domination game (Henning et al. in Graphs Comb 31:1453–1462 (2015) are by now well established games played on graphs by two players, named Dominator and Staller. In this paper, Z-domination game, L-domination game, and LL-domination game are introduced as natural companions of the standard domination games. Versions of the Continuation Principle are proved for the new games. It is proved that in each of these games the outcome of the game, which is a corresponding graph invariant, differs by at most one depending whether Dominator or Staller starts the game. The hierarchy of the five domination games is established. The invariants are also bounded with respect to the (total) domination number and to the order of a graph. Values of the three new invariants are determined for paths up to a small constant independent from the length of a path. Several open problems and a conjecture are listed. The latter asserts that the L-domination game number is not greater than 6 / 7 of the order of a graph. © 2019, Springer Nature Switzerland AG
- …